Ideal Point Distributions, Best Mode Selections and Optimal Spatial Partitions via Centroidal Voronoi Tessellations

نویسندگان

  • Maria Emelianenko
  • Hyung-Chun Lee
  • Xiaoqiang Wang
چکیده

There are many new applications of the centroidal Voronoi tessellations that come to life in recent years, along with more mathematical understandings and new algorithmic advances in their efficient computation. Some examples are presented in this paper as an illustration with an emphasis on the construction of ideal point distributions, best mode selections and optimal spatial partitions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved initialisation for centroidal Voronoi tessellation and optimal Delaunay triangulation

Centroidal Voronoi tessellations and optimal Delaunay triangulations can be approximated efficiently by non-linear optimisation algorithms. This paper demonstrates that the point distribution used to initialise the optimisation algorithms is important. Compared to conventional random initialisation, certain low-discrepancy point distributions help convergence towards more spatially regular resu...

متن کامل

Constrained Centroidal Voronoi Tessellations for Surfaces

Abstract. Centroidal Voronoi tessellations are useful for subdividing a region in Euclidean space into Voronoi regions whose generators are also the centers of mass, with respect to a prescribed density function, of the regions. Their extensions to general spaces and sets are also available; for example, tessellations of surfaces in a Euclidean space may be considered. In this paper, a precise ...

متن کامل

Mesh Optimization Based on the Centroidal Voronoi Tessellation

The subject of mesh generation and optimization is very important in many scientific applications. In this paper, we investigate the issue of mesh optimization via the construction of Centroidal Voronoi Tessellations. Given some initial Delaunay meshes with only average quality, it is shown that the CVT based mesh optimization generates a robust, high quality mesh which does not rely critically...

متن کامل

Capacity-Constrained Voronoi Tessellations: Computation and Applications

Voronoi tessellations specify a partition of a given space according to a set of sites where all points in that space are assigned to the closest site. Capacity-constrained Voronoi tessellations are special cases of Voronoi tessellations in which the region of each site has a predefined area. For example, the capacity constraint could state that each region in a Voronoi tessellation must have t...

متن کامل

Grid generation and optimization based on centroidal Voronoi tessellations

Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a region such that the generating points of the tessellations are also the centroids of the corresponding Voronoi regions. Such tessellations are of use in very diverse applications, including data compression, clustering analysis, cell biology, territorial behavior of animals, and optimal allocation of resources. In this pape...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005